Lossless Source Coding in the Point-to-Point, Multiple Access, and Random Access Scenarios

This paper treats point-to-point, multiple access and random access lossless source coding in the finite-blocklength regime. A random coding technique is developed, and its power in analyzing the third-order coding performance is demonstrated in all three scenarios. Results include a third-order-optimal characterization of the Slepian-Wolf rate region and a proof showing that for dependent sources, the independent encoders used by Slepian-Wolf codes can achieve the same third-order- optimal performance as a single joint encoder. The concept of random access source coding, which generalizes the multiple access scenario to allow for a subset of participating encoders that is unknown a priori to both the encoders and the decoder, is introduced. Contributions include a new definition of the probabilistic model for a random access-discrete multiple source, a general random access source coding scheme that employs a rateless code with sporadic feedback, and an analysis demonstrating via a random coding argument that there exists a deterministic code of the proposed structure that simultaneously achieves the third- order-optimal performance of Slepian-Wolf codes for all possible subsets of encoders

Lossless Source Coding in the Point-to-Point, Multiple Access, and Random Access Scenarios

This paper treats point-to-point, multiple access and random access lossless source coding in the finite-blocklength regime. A random coding technique is developed, and its power in analyzing the third-order coding performance is demonstrated in all three scenarios. Via a connection to composite hypothesis testing, a new converse that tightens previously known converses for Slepian-Wolf source coding is established. Asymptotic results include a third-order characterization of the Slepian-Wolf rate region and a proof showing that for dependent sources, the independent encoders used by Slepian-Wolf codes can achieve the same third-order-optimal performance as a single joint encoder. The concept of random access source coding, which generalizes the multiple access scenario to allow for a subset of participating encoders that is unknown a priori to both the encoders and the decoder, is introduced. Contributions include a new definition of the probabilistic model for a random access source, a general random access source coding scheme that employs a rateless code with sporadic feedback, and an analysis demonstrating via a random coding argument that there exists a deterministic code of the proposed structure that simultaneously achieves the third-order-optimal performance of Slepian-Wolf codes for all possible subsets of encoders.Comment: 42 pages, 10 figures. Part of this work was presented at ISIT'1

Exploring achievement gamification on online medical quality based on machine learning and empirical analysis

How to improve online medical quality is an important challenge for practitioners of digital health platforms. Gamification creates new opportunities to deal with the problem persistent in online health services. To better understand the role of gamification in online health services context, this study intends to use the research method of machine learning and natural experiment to explore the impact of achievement gamification on online medical quality in online health services, as well as the moderating effects of doctors’ personality and image. Theoretically, this study will expand the application of game strategy in the field of healthcare, and make up for the deficiency of the effects of gamification on online medical quality. Practically, it provides guidance for promoting doctors\u27 online participation behavior, improves the quality of online health services, and suggests ways for optimizing the rational allocation of online health resources

A New Leptoceratopsid (Ornithischia: Ceratopsia) from the Upper Cretaceous of Shandong, China and Its Implications for Neoceratopsian Evolution

BACKGROUND: The ceratopsians represent one of the last dinosaurian radiations. Traditionally the only universally accepted speciose clade within the group was the Ceratopsidae. However, recent discoveries and phylogenetic analyses have led to the recognition of a new speciose clade, the Leptoceratopsidae, which is predominantly known from the Upper Cretaceous of North America. METHODOLOGY/PRINCIPAL FINDINGS: Here we report a new leptoceratopsid taxon, Zhuchengceratops inexpectus gen. et sp. nov., based on a partial, articulated skeleton recovered from the Upper Cretaceous Wangshi Group of Zhucheng, Shandong Province, China. Although Zhuchengceratops is significantly different from other known leptoceratopsids, it is recovered as a derived member of the group by our phylogenetic analysis. Furthermore, Zhuchengceratops exhibits several features previously unknown in leptoceratopsids but seen in ceratopsids and their close relatives, suggesting that the distribution of morphological features within ceratopsians is more complex than previously realized. CONCLUSION/SIGNIFICANCE: The discovery of Zhuchengceratops increases both the taxonomic diversity and the morphological disparity of the Leptoceratopsidae, providing further support for the hypothesis that this clade represents a successful radiation of horned dinosaurs in parallel with the Ceratopsidae in the Late Cretaceous. This documents a surprising case of the coexistence and radiation of two closely-related lineages with contrasting suites of jaw and dental features that probably reflect adaptation to different food resources

Research on User Interest Expression and Recommendation Service based on Three-dimensional Relationship of Users and Items

The existing recommendation algorithms often rely heavily on the original score information in the user rating matrix. However, the user's rating of items does not fully reflect the user's real interest. Therefore, the key to improve the existing recommendation system algorithm effectively is to eliminate the influence of these unfavorable factors and the accuracy of the recommendation algorithm can be improved by correcting the original user rating information reasonably. This paper makes a comprehensive theoretical analysis and method design from three aspects: the quality of the item, the memory function of the user and the influence of the social friends trusted by the user on the user's rating. Based on these methods, this paper finally proposes a collaborative filtering recommendation algorithm (FixCF) based on user rating modification. Using data sets such as Movielens, Epinions and Flixster, the data sets are divided into five representative subsets, and the experimental demonstration is carried out. FixCF and classical collaborative filtering algorithms, existing matrix decomposition-based algorithms and trust network-based inference are compared. The experimental results show that the accuracy and coverage of FixCF have been improved under many experimental conditions

Analgesia for total knee arthroplasty: a meta-analysis comparing local infiltration and femoral nerve block

Patients frequently experience postoperative pain after a total knee arthroplasty; such pain is always challenging to treat and may delay the patient’s recovery. It is unclear whether local infiltration or a femoral nerve block offers a better analgesic effect after total knee arthroplasty.We performed a systematic review and meta-analysis of randomized controlled trials to compare local infiltration with a femoral nerve block in patients who underwent a primary unilateral total knee arthroplasty. We searched Pubmed, EMBASE, and the Cochrane Library through December 2014. Two reviewers scanned abstracts and extracted data. The data collected included numeric rating scale values for pain at rest and pain upon movement and opioid consumption in the first 24 hours. Mean differences with 95% confidence intervals were calculated for each end point. A sensitivity analysis was conducted to evaluate potential sources of heterogeneity.While the numeric rating scale values for pain upon movement (MD-0.62; 95%CI: -1.13 to -0.12; p=0.02) in the first 24 hours differed significantly between the patients who received local infiltration and those who received a femoral nerve block, there were no differences in the numeric rating scale results for pain at rest (MD-0.42; 95%CI:-1.32 to 0.47; p=0.35) or opioid consumption (MD 2.92; 95%CI:-1.32 to 7.16; p=0.18) in the first 24 hours.Local infiltration and femoral nerve block showed no significant differences in pain intensity at rest or opioid consumption after total knee arthroplasty, but the femoral nerve block was associated with reduced pain upon movement